National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
An algorithm for extending partial planar drawings
Hora, Martin ; Jelínek, Vít (advisor) ; Šámal, Robert (referee)
This thesis studies the problem of partially embedded planarity. The input of the problem is a graph G and a planar drawing of a subgraph of G. The goal is to decide whether the drawing of the subgraph can be extended to a planar drawing of the entire graph G. It has already been proved that the partially embedded planarity problem can be solved in linear time. However, all known linear algorithms are relatively complicated. This is probably the reason that no implementation has yet been published. We will introduce a new, simpler linear algorithm that solves the problem and we will prove its correctness. Next, we will enclose an implementation of this algorithm in the C++ programming language. 1
Optical Set-up for Small Volume of Liquid Surface Tension Measurement
Hošek, Jan ; Studenovský, K.
The goal of the presented work is to optimize the experimental set-up of the end-tip meniscus planarity observation and detection in the case of Furgeson method for small volume of liquid surface tension measurement. A new, compact and sensitive experimental optical set-up is designed for the meniscus planarity measurement.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.